Martingales with a Countable Filtering Index Set

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Largest Countable Inductive Set is A Mouse Set

Let R be the least ordinal such that L (R) is admissible. Let A = fx 2 R j (9 < R) s.t. x is ordinal deenable in L (R) g. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the theory: ZFC Replacement + \There exists ! Woodin cardinals which are coonal in the ordinals." T has consistency strength weaker than that of the theory ZFC + \There e...

متن کامل

Menger's Theorem for a Countable Source Set

Paul Erd} os has conjectured that Menger's theorem extends to innnite graphs in the following way: whenever A; B are two sets of vertices in an innnite graph, there exist a set of disjoint A{B paths and an A{B separator in this graph so that the separator consists of a choice of precisely one vertex from each of the paths. We prove this conjecture for graphs that contain a set of disjoint paths...

متن کامل

AIF-ω: Set-Based Protocol Abstraction with Countable Families

Abstraction based approaches like ProVerif are very efficient in protocol verification, but have a limitation in dealing with stateful protocols. A number of extensions have been proposed to allow for a limited amount of state information while not destroying the advantages of the abstraction method. However, the extensions proposed so far can only deal with a finite amount of state information...

متن کامل

Limited Set quantifiers over Countable Linear Orderings

In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...

متن کامل

A Mind of a Non-countable Set of Ideas

The paper is dedicated to the 80 birthday of the outstanding Russian logician A.V. Kuznetsov. It is addressing a history of the ideas and research conducted by him in non-classical and intermediate logics.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1977

ISSN: 0091-1798

DOI: 10.1214/aop/1176995658